Non-bisimulation-based Markovian behavioral equivalences
نویسندگان
چکیده
منابع مشابه
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that Markovian bisimilarity is consistent with ordinary lumping. The latter is an aggregation for Markov chains that is exact, hence it guarantees the preservation of the performance characteristics across Markovian bisi...
متن کاملA Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches to their definition: bisimilarity, testing, and trace. In this paper we survey the major results appeared in the literature about Markovian bisimilarity, Markovian testing equivalence, and Markovian trace equivalence....
متن کاملNon-interleaving bisimulation equivalences on Basic Parallel Processes
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n logn)) and history preserving bisimilarity (in O(n)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on this class....
متن کاملBehavioral Equivalences
DEFINITION: Beahvioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment. Behavioral equivalences have been mainly developed in the context of process algebras, mathematically rigorous languages that have been used for describing and verifying prope...
متن کاملLogical characterization of probabilistic τ -bisimulation equivalences
Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2007
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.02.002